Attacking the Busy Beaver 5
نویسندگان
چکیده
Since T. Rado in 1962 defined the busy beaver game several approaches have used computer technology to search busy beavers or even compute special values of Σ. Σ(5) is not yet known. A new approach to the computation of Σ(5) is presented, together with preliminary results, especially Σ(5)≥4098. This approach includes techniques to reduce the number of inspected Turing machines, to accelerate simulation of Turing machines and to decide nontermination of Turing machines.
منابع مشابه
Busy Beaver – An Evolutionary Approach
The Busy Beaver is an interesting theoretical problem proposed by Tibor Rado in 1962. Since then, it has attracted the attention of many researchers and several contests were organised trying to produce good solutions. In this paper, we propose an evolutionary approach to the problem. Our experimental results prove that this technique is very effective in attacking Busy Beaver, since we were ab...
متن کاملGenerating Candidate Busy Beaver Machines (Or How to Build the Zany Zoo)
The busy beaver problem is a well-known example of a non-computable function. In order to determine a particular value of this function, it is necessary to generate and classify a large number of Turing machines. Previous work on this problem has described the processes used for the generation and classification of these machines, but unfortunately has generally not provided details of the mach...
متن کاملSmall Turing machines and generalized busy beaver competition
Let TM(k, l) be the set of one-tape Turing machines with k states and l symbols. It is known that the halting problem is decidable for machines in TM(2, 3) and TM(3, 2). We prove that the decidability of machines in TM(2, 4) and TM(3, 3) will be difficult to settle, by giving machines in these sets for which the halting problem depends on an open problem in number theory. A machine in TM(5, 2) ...
متن کاملAnalysis of Busy Beaver Machines via Induction Proofs
The busy beaver problem is to find the maximum number of 1’s that can be printed by an n-state Turing machine of a particular type. A critical step in the evaluation of this value is to determine whether or not a given n-state Turing machine halts. Whilst this is undecidable in general, it is known to be decidable for n ≤ 3, and undecidable for n ≥ 19. In particular, the decidability question i...
متن کاملA Busy Beaver Problem for Infinite-Time Turing Machines
This note introduces a generalization to the setting of infinite-time computation of the busy beaver problem from classical computability theory, and proves some results concerning the growth rate of an associated function. In our view, these results indicate that the generalization is both natural and promising.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bulletin of the EATCS
دوره 40 شماره
صفحات -
تاریخ انتشار 1990